منابع مشابه
The Majority Strategy on Graphs
In a tree one can find the median set of a profile simply by starting at an arbitrary vertex and then moving to the majority of the profile. This strategy is formulated for arbitrary graphs. The graphs for which this strategy produces always the median set M(E), for each profile 7t, are precisely the median graphs. AMS C/ass$cication: Primary: 05C12,OSC75,05C99; secondary: 90B80
متن کاملMajority Model on Random Regular Graphs
Consider a graph G = (V, E) and an initial random coloring where each vertex v ∈ V is blue with probability Pb and red otherwise, independently from all other vertices. In each round, all vertices simultaneously switch their color to the most frequent color in their neighborhood and in case of a tie, a vertex keeps its current color. The main goal of the present paper is to analyze the behavior...
متن کاملMajority-vote model on random graphs.
The majority-vote model with noise on Erdös-Rényi's random graphs has been studied. Monte Carlo simulations were performed to characterize the order-disorder phase transition appearing in the system. We found that the value of the critical noise parameter qc is an increasing function of the mean connectivity z of the random graph. The critical exponents beta/nu, gamma/nu, and 1/nu were calculat...
متن کاملLocal Majority Dynamics on Preferential Attachment Graphs
Suppose in a graph G vertices can be either red or blue. Let k be odd. At each time step, each vertex v in G polls k random neighbours and takes the majority colour. If it doesn’t have k neighbours, it simply polls all of them, or all less one if the degree of v is even. We study this protocol on the preferential attachment model of Albert and Barabási [3], which gives rise to a degree distribu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00072-3